<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Hard
  </div>
  <div>
   <h1 class="question_title">
    85. Maximal Rectangle
   </h1>
   <p>
    Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong>
[
  ["1","0","1","0","0"],
  ["1","0","<strong>1</strong>","<strong>1</strong>","<strong>1</strong>"],
  ["1","1","<strong>1</strong>","<strong>1</strong>","<strong>1</strong>"],
  ["1","0","0","1","0"]
]
<strong>Output:</strong> 6
</pre>
  </div>
  <div>
   <h1 class="question_title">
    85. 最大矩形
   </h1>
   <p>
    给定一个仅包含&nbsp;0 和 1 的二维二进制矩阵，找出只包含 1 的最大矩形，并返回其面积。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong>
[
  ["1","0","1","0","0"],
  ["1","0","<strong>1</strong>","<strong>1</strong>","<strong>1</strong>"],
  ["1","1","<strong>1</strong>","<strong>1</strong>","<strong>1</strong>"],
  ["1","0","0","1","0"]
]
<strong>输出:</strong> 6</pre>
  </div>
 </body>
</html>